<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: IntroductionToAlgorithm::GraphAlgorithm::Edge&lt; VType &gt; Struct Template Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="classes.html"><span>Class&#160;Index</span></a></li>
      <li><a href="hierarchy.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="summary">
<a href="#pub-types">Public Types</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge-members.html">List of all members</a>  </div>
  <div class="headertitle">
<div class="title">IntroductionToAlgorithm::GraphAlgorithm::Edge&lt; VType &gt; Struct Template Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>Edge：图的边，算法导论22章22.1节  
 <a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#details">More...</a></p>

<p><code>#include &lt;<a class="el" href="edge_8h_source.html">edge.h</a>&gt;</code></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:a92b817240405b82f23dee4cdbefcb54f"><td class="memItemLeft" align="right" valign="top">typedef int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a92b817240405b82f23dee4cdbefcb54f">VIDType</a></td></tr>
<tr class="separator:a92b817240405b82f23dee4cdbefcb54f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a95cf631669c2a0d1bebb58ba2af110de"><td class="memItemLeft" align="right" valign="top">typedef int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">EWeightType</a></td></tr>
<tr class="separator:a95cf631669c2a0d1bebb58ba2af110de"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2a7bb332de66131ed664eb279c7ac1ed"><td class="memItemLeft" align="right" valign="top">typedef VType&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a></td></tr>
<tr class="separator:a2a7bb332de66131ed664eb279c7ac1ed"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6cc12c05f7645ce74a6cff13b9ea932c"><td class="memItemLeft" align="right" valign="top">typedef std::tuple&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a92b817240405b82f23dee4cdbefcb54f">VIDType</a>, <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a92b817240405b82f23dee4cdbefcb54f">VIDType</a>, <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">EWeightType</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a6cc12c05f7645ce74a6cff13b9ea932c">EdgeTupleType</a></td></tr>
<tr class="separator:a6cc12c05f7645ce74a6cff13b9ea932c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:adf42723a706c3ff53b1d1bb612dfe03b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#adf42723a706c3ff53b1d1bb612dfe03b">Edge</a> (std::shared_ptr&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a> &gt;v1, std::shared_ptr&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a> &gt;v2, <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">EWeightType</a> w)</td></tr>
<tr class="memdesc:adf42723a706c3ff53b1d1bb612dfe03b"><td class="mdescLeft">&#160;</td><td class="mdescRight">显式构造函数，必须指定两个顶点和一个权重  <a href="#adf42723a706c3ff53b1d1bb612dfe03b">More...</a><br /></td></tr>
<tr class="separator:adf42723a706c3ff53b1d1bb612dfe03b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9f7ecd0678638168991435c8370c8dae"><td class="memItemLeft" align="right" valign="top">virtual std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a9f7ecd0678638168991435c8370c8dae">to_string</a> () const </td></tr>
<tr class="memdesc:a9f7ecd0678638168991435c8370c8dae"><td class="mdescLeft">&#160;</td><td class="mdescRight">to_string：返回边的字符串描述  <a href="#a9f7ecd0678638168991435c8370c8dae">More...</a><br /></td></tr>
<tr class="separator:a9f7ecd0678638168991435c8370c8dae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1068057fa7240467e079d66a1a5edd7a"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a6cc12c05f7645ce74a6cff13b9ea932c">EdgeTupleType</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a1068057fa7240467e079d66a1a5edd7a">edge_tuple</a> () const </td></tr>
<tr class="memdesc:a1068057fa7240467e079d66a1a5edd7a"><td class="mdescLeft">&#160;</td><td class="mdescRight">edge_tuple：获取边的三元素元组  <a href="#a1068057fa7240467e079d66a1a5edd7a">More...</a><br /></td></tr>
<tr class="separator:a1068057fa7240467e079d66a1a5edd7a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a634535a3f12be42c3c6ffb6d3c604fb7"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a634535a3f12be42c3c6ffb6d3c604fb7">vertex1</a></td></tr>
<tr class="separator:a634535a3f12be42c3c6ffb6d3c604fb7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a762ca9f6ad5abb1adf8b7e1319ea3b52"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a762ca9f6ad5abb1adf8b7e1319ea3b52">vertex2</a></td></tr>
<tr class="separator:a762ca9f6ad5abb1adf8b7e1319ea3b52"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a139b40cb4524df195804bdce7a117164"><td class="memItemLeft" align="right" valign="top"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">EWeightType</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a139b40cb4524df195804bdce7a117164">weight</a></td></tr>
<tr class="separator:a139b40cb4524df195804bdce7a117164"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><h3>template&lt;typename VType&gt;<br />
struct IntroductionToAlgorithm::GraphAlgorithm::Edge&lt; VType &gt;</h3>

<p>Edge：图的边，算法导论22章22.1节 </p>
<p>边主要包含三个数据：</p>
<ul>
<li><code>vertex1</code>：第一个顶点的强引用：</li>
<li><code>vertex2</code>为第二个顶点的强引用。</li>
<li><code>weight</code>: 边的权重（为int类型，可为正、负值）</li>
</ul>
<p>为了便于计算，这里定义了一个元组，类型为<code>std::tuple&lt;VIDType,VIDType,EWeightType&gt;</code>，元组的第一个元素为第一个顶点的<code>id</code>；元组的第二个元素为第二个顶点的<code>id</code>； 元组的第三个元素为边的权重。 </p>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00039">39</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>
</div><h2 class="groupheader">Member Typedef Documentation</h2>
<a class="anchor" id="a6cc12c05f7645ce74a6cff13b9ea932c"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">typedef std::tuple&lt;<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a92b817240405b82f23dee4cdbefcb54f">VIDType</a>,<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a92b817240405b82f23dee4cdbefcb54f">VIDType</a>,<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">EWeightType</a>&gt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a6cc12c05f7645ce74a6cff13b9ea932c">EdgeTupleType</a></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>边的三元素（顶点1编号，顶点2编号，权重)组成的元组 </p>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00045">45</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<a class="anchor" id="a95cf631669c2a0d1bebb58ba2af110de"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">typedef int <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">EWeightType</a></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>权重的类型 </p>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00043">43</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<a class="anchor" id="a2a7bb332de66131ed664eb279c7ac1ed"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">typedef VType <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>顶点的类型 </p>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00044">44</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<a class="anchor" id="a92b817240405b82f23dee4cdbefcb54f"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">typedef int <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a92b817240405b82f23dee4cdbefcb54f">VIDType</a></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>顶点编号的类型 </p>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00042">42</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a class="anchor" id="adf42723a706c3ff53b1d1bb612dfe03b"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">Edge</a> </td>
          <td>(</td>
          <td class="paramtype">std::shared_ptr&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a> &gt;&#160;</td>
          <td class="paramname"><em>v1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">std::shared_ptr&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a> &gt;&#160;</td>
          <td class="paramname"><em>v2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">EWeightType</a>&#160;</td>
          <td class="paramname"><em>w</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>显式构造函数，必须指定两个顶点和一个权重 </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">v1:第一个顶点的强引用</td><td></td></tr>
    <tr><td class="paramname">v2:第二个顶点的强引用</td><td></td></tr>
    <tr><td class="paramname">w</td><td>边的权重 </td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00052">52</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a class="anchor" id="a1068057fa7240467e079d66a1a5edd7a"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a6cc12c05f7645ce74a6cff13b9ea932c">EdgeTupleType</a> <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::edge_tuple </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>edge_tuple：获取边的三元素元组 </p>
<dl class="section return"><dt>Returns</dt><dd>:边的三元素元组 </dd></dl>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00072">72</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<a class="anchor" id="a9f7ecd0678638168991435c8370c8dae"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual std::string <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::to_string </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>to_string：返回边的字符串描述 </p>
<dl class="section return"><dt>Returns</dt><dd>:边的字符串描述 </dd></dl>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00062">62</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a class="anchor" id="a634535a3f12be42c3c6ffb6d3c604fb7"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">std::shared_ptr&lt;<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a>&gt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::vertex1</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>边的第一个顶点 </p>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00076">76</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<a class="anchor" id="a762ca9f6ad5abb1adf8b7e1319ea3b52"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">std::shared_ptr&lt;<a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a2a7bb332de66131ed664eb279c7ac1ed">VertexType</a>&gt; <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::vertex2</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>边的第二个顶点 </p>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00077">77</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<a class="anchor" id="a139b40cb4524df195804bdce7a117164"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename VType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html#a95cf631669c2a0d1bebb58ba2af110de">EWeightType</a> <a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">IntroductionToAlgorithm::GraphAlgorithm::Edge</a>&lt; VType &gt;::weight</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>边的权重 </p>

<p>Definition at line <a class="el" href="edge_8h_source.html#l00078">78</a> of file <a class="el" href="edge_8h_source.html">edge.h</a>.</p>

</div>
</div>
<hr/>The documentation for this struct was generated from the following file:<ul>
<li>src/graph_algorithms/basic_graph/graph_representation/graph_edge/<a class="el" href="edge_8h_source.html">edge.h</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></li><li class="navelem"><a class="el" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html">GraphAlgorithm</a></li><li class="navelem"><a class="el" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_edge.html">Edge</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
